Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
a → g(c)
g(a) → b
f(g(X), b) → f(a, X)
Q is empty.
↳ QTRS
↳ DirectTerminationProof
Q restricted rewrite system:
The TRS R consists of the following rules:
a → g(c)
g(a) → b
f(g(X), b) → f(a, X)
Q is empty.
We use [23] with the following order to prove termination.
Recursive path order with status [2].
Quasi-Precedence:
[a, b] > [g1, f2]
[a, b] > c
Status: b: multiset
a: multiset
f2: multiset
c: multiset
g1: multiset